|
|
Warehouse Modeling Using Graphical User Interface
Rajnoha, Martin
This paper describes a new algorithm which enable efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any place in warehouses and does so significantly faster than traditional approaches. For this purpose an algorithm based on Breadth first search, image processing “skeletonization” and Dijkstra algorithm was proposed. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is approximately hundreds of microseconds using routing table and even it is independent on size of warehouse instead of using Dijkstra algorithm.
|
|
|
Warehouse modeling using graphical user interface
Rajnoha, Martin ; Mašek, Jan (referee) ; Burget, Radim (advisor)
Master’s thesis proposes a new algorithm which enables efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any places in warehouse based on Breadth first search, image processing „skeletonization“ and Dijkstra algorithm. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is less then milisecond using routing table and even size of warehouse doesn’t affect it significantly instead of using Dijkstra algorithm.
|
|
|
Warehouse Modeling Using Graphical User Interface
Rajnoha, Martin
This paper describes a new algorithm which enable efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any place in warehouses and does so significantly faster than traditional approaches. For this purpose an algorithm based on Breadth first search, image processing “skeletonization” and Dijkstra algorithm was proposed. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is approximately hundreds of microseconds using routing table and even it is independent on size of warehouse instead of using Dijkstra algorithm.
|
|
|
Roads and paths in geographical databases of Czech Republic - analysis of their existence and geometric accuracy, the new proposal of classification
Zub, Daniel ; Šára, Pavel (advisor) ; Jaroš, Jakub (referee)
Roads and paths in geographical databases of Czech republic - analysis of their existence and geometric accuracy, the new proposal of classification Abstract The fundamental objective of this bachelor thesis was to assess the network of roads and paths in geographic databases ZABAGED, DMÚ 25, ÚHÚL, SHOCart and maps for orienteering. The analysis of roads and paths was based on the geometric accuracy and the existence in databases due to the targeted forest road network in a limited forested land. The measurement was carried out the tourist receiver GPS for fieldwork. This bachelor thesis is divided into three parts. Firstly the classification of road network databases are compared and the basics of their geometric precision are given. The second part is dedicated to the principle of measuring GPS and errors that might occur. The calculate the accuracy of the receiver of unfavorable conditions when the measurement is influenced by many aspects is included too. The third part deals with the actual comparison of databases focused road network. The main output is a detailed map of the area at a scale of 1: 10 000 measured with a network of roads and paths. Keywords: forest road, path, geographic databases of Czech republic, classification of forest road network, Global Positioning System
|
|
|
Warehouse modeling using graphical user interface
Rajnoha, Martin ; Mašek, Jan (referee) ; Burget, Radim (advisor)
Master’s thesis proposes a new algorithm which enables efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any places in warehouse based on Breadth first search, image processing „skeletonization“ and Dijkstra algorithm. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is less then milisecond using routing table and even size of warehouse doesn’t affect it significantly instead of using Dijkstra algorithm.
|
|
|
Time-space activity of population in suburbs České Budějovice: geographic analysis
ZEZULOVÁ, Martina
The thesis is divided into 3 main parts. The first part is focused on theoretical introduction of time geography. It is also focused on development, concepts and applications. Theoretical part follows up the concept of suburbanization. In the second, methodical part, is explained the concept of the survey, selection of respondents and implementation of the questionnaire survey. Practical and last part is based on an analysis of data obtained using a questionnaire survey of population České Budějovice suburbs.
|
guest ::
